Maximum Flow of Minimum Bi-criteria Cost in Dynamic Networks
نویسندگان
چکیده
The article studies the generalisation of the maximum flow of minimum cost problem for the case of maximum discrete dynamic flow of minimum travelling cost and travelling time. The approach is based on iteratively generating efficient extreme points in the objective space by solving a series of single objective maximum flow problems with different objective functions. On each of the iterations, the flow is augmented along a cheapest path from the source node to the sink node in the time-space network avoiding the explicit time expansion of the network. Key-Words: Dynamic network, maximum flow, bi-criteria flow, successive shortest path
منابع مشابه
A Parametric Approach to the Bi-criteria Minimum Cost Dynamic Flow Problem
This paper presents an algorithm for solving Bi-criteria Minimum Cost Dynamic Flow (BiCMCDF) problem with continuous flow variables. The approach is to transform a bi-criteria problem into a parametric one by building a single parametric linear cost out of the two initial cost functions. The algorithm consecutively finds efficient extreme points in the decision space by solving a series of mini...
متن کاملMethod for the minimum cost maximum flow determining in fuzzy dynamic network with nonzero flow bounds
In this paper the method for the minimum cost flow determining in fuzzy dynamic network with nonzero lower flow bounds is proposed. Considered method takes into account fuzzy nature of networks’ parameters and deals with fuzzy arc flow bounds, fuzzy transmission costs. Fuzzy arc flow bounds, costs and transit times can vary depending on the flow departure time. The method allows introducing the...
متن کاملOptimal multicommodity flows in dynamic networks and algorithms for their finding
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملOptimum Design of Liquified Natural Gas Bi-lobe Tanks using Finite Element, Genetic Algorithm and Neural Network
A comprehensive set of ten artificial neural networks is developed to suggest optimal dimensions of type ‘C’ Bi-lobe tanks used in the shipping of liquefied natural gas. Multi-objective optimization technique considering the maximum capacity and minimum cost of vessels are implemented for determining optimum vessel dimensions. Generated populations from a genet...
متن کامل